Security Applications of Formal Language Theory Dartmouth Computer Science Technical Report TR2011-709 Len Sassaman, Meredith L. Patterson, Sergey Bratus, Michael E. Locasto, Anna Shubina

Source URL: langsec.org

• Mathematics
• Deterministic pushdown automaton
• Parsing
• Computability
• Context-free grammar
• Context-free language
• Formal grammar
• Finite-state machine
• Recursive language
• Formal languages
• Theoretical computer science
• Theory of computation

2010 Paper 3 Question 3 Compiler Construction (a) What are the principal features of a regular language and of a context-free language and their respective parsers? [4 marks]

Source URL: www.cl.cam.ac.uk

Free online dictionaries with context sentences, synonyms, and pronunciation Language games and quizzes Vocabulary lessons and conjugation tables Phrasebooks for work, university, travel, and living abroad

Source URL: ar.bab.la

Nebel et al. Algorithms for Molecular Biology 2011, 6:24 http://www.almob.org/contentRESEARCH Open Access

Source URL: www.almob.org

• Science
• Bioinformatics
• Theoretical computer science
• Statistical natural language processing
• Stochastic context-free grammar
• Nucleic acid structure prediction
• Pseudoknot
• Combinatorics
• Biomolecular structure
• RNA
• Genetics
• Biology

Language-Independent Discriminative Parsing of Temporal Expressions Gabor Angeli Stanford University Stanford, CA 94305

Source URL: stanford.edu

• Software
• Compiler construction
• Parsing
• Computational linguistics
• Statistical natural language processing
• Attribute grammar
• Formal grammar
• Parse tree
• Stochastic context-free grammar
• Formal languages
• Software engineering
• Computing

BRICS Basic Research in Computer Science BRICS RS-03-7 Brabrand et al.: The METAFRONT System: Extensible Parsing and Transformation

Source URL: www.brics.dk

• Computing
• LR parser
• Parsing
• Bottom-up parsing
• LL parser
• Top-down parsing
• Formal grammar
• Context-free grammar
• Terminal and nonterminal symbols
• Formal languages
• Software engineering
• Programming language implementation

ATL Transformation: Feature Models for representing runtime variability in BIS to Business Process Model Notation∗ Ildefonso Montero, Joaquín Peña, Antonio Ruiz-Cortés Departamento de Lenguajes y Sistemas Informáti

Source URL: www.isa.us.es

• Systems engineering
• Systems science
• Business Process Model and Notation
• Diagrams
• Business Process Execution Language
• Business process modeling
• Context-free grammar
• B1
• B2
• Process management
• Management
• Design

PDF Document

Source URL: www-igm.univ-mlv.fr

• Nested word
• Words
• Pushdown automaton
• Context-free language
• Symbol
• Finite-state machine
• Mathematics
• Linguistics
• Computing
• Automata theory
• Models of computation
• Formal languages

The University of Cambridge Russian-English System at WMT13 Juan Pino Aurelien Waite Tong Xiao Adri`a de Gispert Federico Flego William Byrne Department of Engineering, University of Cambridge, Cambridge, CB2 1PZ, UK {jm

Source URL: www.aclweb.org

• Natural language processing
• Machine translation
• Statistical natural language processing
• Speech recognition
• Evaluation of machine translation
• Statistical machine translation
• BLEU
• Word-sense disambiguation
• Synchronous context-free grammar
• Linguistics
• Science
• Computational linguistics

Parsing Composed Grammars with Language Boxes Lukas Diekmann and Laurence Tratt Software Development Team, King’s College London http://soft-dev.org/

Source URL: soft-dev.org

• Computing
• Parsing expression grammar
• LL parser
• Parsing
• Scannerless parsing
• Context-free grammar
• Recursive descent parser
• LR parser
• Formal grammar
• Formal languages
• Software engineering
• Programming language implementation